Positional Number Systems with Digits Forming an Arithmetic Progression
نویسندگان
چکیده
Abstract. A novel digit system that arises in a natural way in a graph-theoretical problem is studied. It is defined by a set of positive digits forming an arithmetic progression and, necessarily, a complete residue system modulo the base b. Since this is not enough to guarantee existence of a digital representation, the most significant digit is allowed to come from an extended set. We provide explicit formulæ for the jth digit in such a representation as well as for the length. Furthermore, we study digit frequencies and average lengths, thus generalising classical results for the base-b representation. For this purpose, an appropriately adapted form of the MellinPerron approach is employed.
منابع مشابه
Project Description SHF Medium: Digital Yet Deliberately Random – Synthesizing Logical Computation on Stochastic Bit Streams
Humans are accustomed to counting in a positional number system – decimal radix. Nearly all computer systems operate on another positional number system – binary radix. From the standpoint of representation, such positional systems are compact: given a radix b, one can represent b distinct numbers with n digits. Each choice of the digits di ∈ {0, . . . , b−1}, i = 0, . . . , n−1, results in a d...
متن کاملDesign and Synthesis of High Speed Low Power Signed Digit Adders
Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...
متن کاملA Combinatorial Approach to Positional Number Systems
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in the binary case digits 0 and 1. A binary positional number system (binary radix system) with base equal the golden ratio (1 + √ 5)/2 is fairly well known. The main result of this paper is a construction of infinitely many binary radix systems, each one construct...
متن کاملA Combinatorial Approach to Binary Positional Number Systems
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in the binary case – digits 0 and 1. A binary positional number system (binary radix system) with base equal to the golden ratio (1 + √ 5 )/2 is fairly well known. The main result of this paper is a construction of infinitely many binary radix systems, each one con...
متن کاملA Golden Ratio Notation for the Real Numbers
Several methods to perform exact computations on real numbers have been proposed in the literature. In some of these methods real numbers are represented by infinite (lazy) strings of digits. It is a well known fact that, when this approach is taken, the standard digit notation cannot be used. New forms of digit notations are necessary. The usual solution to this representation problem consists...
متن کامل